On the independent set interdiction problem
نویسندگان
چکیده
The purpose of the independent set interdiction problem in the weighted graph G is to determine a set of vertices R∗ such that the weight of the maximum independent set in G−R∗ is minimized. We define an approximate solution for this problem. Then, an upper bound for the relative error of this problem is obtained. We show that the limit of the relative error of the independent set interdiction problem in some subclasses of the generalized Petersen graphs is zero as the number of vertices tends to infinity.
منابع مشابه
A Note on the Integrality Gap in the Nodal Interdiction Problem
In the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. In this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. Two path inequalities for the node-only interdiction problem are represented. It has been proved that the integrality gap of relaxation of the maximum fl...
متن کاملInterdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives
Interdiction problems ask about the worst-case impact of a limited change to an underlying optimization problem. They are a natural way to measure the robustness of a system, or to identify its weakest spots. Interdiction problems have been studied for a wide variety of classical combinatorial optimization problems, including maximum s-t flows, shortest s-t paths, maximum weight matchings, mini...
متن کاملOptimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdiction, the task of the interdictor is to find a set of edges in a weighted network such that the removal of those edges would maximally increase the cost to an evader of traveling on a path through the network. Our wo...
متن کاملImproved Algorithms for MST and Metric-TSP Interdiction
We consider the MST-interdiction problem: given a multigraph G = (V,E), edge weights {we ≥ 0}e∈E , interdiction costs {ce ≥ 0}e∈E , and an interdiction budget B ≥ 0, the goal is to remove a set R ⊆ E of edges of total interdiction cost at most B so as to maximize the w-weight of an MST of G−R := (V,E \R). Our main result is a 4-approximation algorithm for this problem. This improves upon the pr...
متن کاملAlgorithms for Discrete and Continuous Multicommodity Flow Network Interdiction Problems
We consider a network interdiction problem on a multicommodity flow network, in which an attacker disables a set of network arcs in order to minimize the maximum profit that can be obtained from shipping commodities across the network. The attacker is assumed to have some budget for destroying (or “interdicting”) arcs, and each arc is associated with a positive interdiction expense. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- EJGTA
دوره 3 شماره
صفحات -
تاریخ انتشار 2015